Integral Cryptanalysis: A New Key Determination Technique for 3-phase Kuznyechik Encryption
نویسندگان
چکیده
Abstract The primary objective of this work is to develop an algorithm for detecting the secret round key used in encryption by analyzing a collection plaintexts and ciphertexts encrypted with three-round Kuznyechik algorithm. In addition, fundamentals using integral cryptanalysis method Substitution-permutation (SP) network-based have been investigated. It has found that useful creating balanced set before third unbalanced at end round, which first byte active, remaining bytes are passive. Based on findings above, efficient determine final 3-round proposed utilizing cryptanalysis. According simulation results, approach offers approximately 90% improvement compared baseline algorithms terms time complexity, data, memory overhead.
منابع مشابه
Cryptanalysis of GSM encryption algorithm A5/1
The A5/1 algorithm is one of the most famous stream cipher algorithms used for over-the-air communication privacy in GSM. The purpose of this paper is to analyze several weaknesses of A5/1, including an improvement to an attack and investigation of the A5/1 state transition. Biham and Dunkelman proposed an attack on A5/1 with a time and data complexity of 239.91and 221.1, ...
متن کاملKey-space analysis of double random phase encryption technique.
We perform a numerical analysis on the double random phase encryption/decryption technique. The key-space of an encryption technique is the set of possible keys that can be used to encode data using that technique. In the case of a strong encryption scheme, many keys must be tried in any brute-force attack on that technique. Traditionally, designers of optical image encryption systems demonstra...
متن کاملPractical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
In this paper, we investigate the security of a public-key encryption scheme introduced by Huang, Liu and Yang (HLY) at PKC’12. This new scheme can be provably reduced to the hardness of solving a set of quadratic equations whose coefficients of highest degree are chosen according to a discrete Gaussian distributions. The other terms being chosen uniformly at random. Such a problem is a variant...
متن کاملMultiset-Algebraic Cryptanalysis of Reduced Kuznyechik, Khazad, and secret SPNs
We devise the first closed formula for the number of rounds of a blockcipher with secret components so that these components can be revealed using multiset, algebraic-degree, or division-integral properties, which in this case are equivalent. Using the new result, we attack 7 (out of 9) rounds of Kuznyechik, the recent Russian blockcipher standard, thus halving its security margin. With the sam...
متن کاملCryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
The fully homomorphic symmetric encryption scheme MORE encrypts keys by conjugation with a random invertible matrix over an RSA modulus. We provide a two known-ciphertexts cryptanalysis recovering a linear dependence among the two encrypted keys. 1. The FHE scheme MORE In their paper [1], Kipnis and Hibshoosh propose, among other things, to use the following type of fully homomorphic encryption...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering research express
سال: 2023
ISSN: ['2631-8695']
DOI: https://doi.org/10.1088/2631-8695/ace58f